Bipartitions of highly connected tournaments
نویسندگان
چکیده
We show that if T is a strongly 10k log(2k)-connected tournament, there exists a partition A,B of V (T ) such that each of T [A], T [B] and T [A,B] is strongly k-connected. This provides solutions to tournament analogues of two partition conjectures of Thomassen regarding highly connected graphs. We also discuss spanning linkages as well as non-separating subdivisions in highly connected tournaments.
منابع مشابه
On n-partite Tournaments with Unique n-cycle
An n-partite tournament is an orientation of a complete n-partite graph. An npartite tournament is a tournament, if it contains exactly one vertex in each partite set. Douglas, Proc. London Math. Soc. 21 (1970) 716-730, obtained a characterization of strongly connected tournaments with exactly one Hamilton cycle (i.e., n-cycle). For n ≥, we characterize strongly connected n-partite tournaments ...
متن کاملWeakly Hamiltonian-connected ordinary multipartite tournaments
We characterize weakly Hamiltonian-connected ordinary multipartite tournaments. Our result generalizes such a characterization for tournaments by Thomassen and implies a polynomial algorithm to decide the existence of a Hamiltonian path connecting two given vertices in an ordinary multipartite tournament and find one, if it exists.
متن کاملOn the maximum density of fixed strongly connected subtournaments
In this paper, we study the density of fixed strongly connected subtournaments on 5 vertices in large tournaments. We determine the maximum density asymptotically for three tournaments as well as extremal families for each tournament. We use Razborov’s semidefinite method for flag algebras to prove the upper bounds.
متن کاملWeakly Complementary Cycles in 3-Connected Multipartite Tournaments
The vertex set of a digraph D is denoted by V (D). A c-partite tournament is an orientation of a complete c-partite graph. A digraph D is called cycle complementary if there exist two vertex disjoint cycles C1 and C2 such that V (D) = V (C1) ∪ V (C2), and a multipartite tournament D is called weakly cycle complementary if there exist two vertex disjoint cycles C1 and C2 such that V (C1) ∪ V (C2...
متن کاملLocal Tournaments and In - Tournaments
Preface Tournaments constitute perhaps the most well-studied class of directed graphs. One of the reasons for the interest in the theory of tournaments is the monograph Topics on Tournaments [58] by Moon published in 1968, covering all results on tournaments known up to this time. In particular, three results deserve special mention: in 1934 Rédei [60] proved that every tournament has a directe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Notes in Discrete Mathematics
دوره 49 شماره
صفحات -
تاریخ انتشار 2015